Rapid Multipole Graph Drawing on the GPU
نویسندگان
چکیده
As graphics processors become powerful, ubiquitous and easier to program, they have also become more amenable to general purpose high-performance computing, including the computationally expensive task of drawing large graphs. This paper describes a new parallel analysis of the multipole method of graph drawing to support its efficient GPU implementation. We use a variation of the Fast Multipole Method to estimate the long distance repulsive forces in force directed layout. We support these multipole computations efficiently with a k-d tree constructed and traversed on the GPU. The algorithm achieves impressive speedup over previous CPU and GPU methods, drawing graphs with hundreds of thousands of vertices within a few seconds via CUDA on an NVIDIA GeForce 8800 GTX.
منابع مشابه
Fast multipole methods on graphics processors
The Fast Multipole Method allows the rapid evaluation of sums of radial basis functions centered at points distributed inside a computational domain at a large number of evaluation points to a specified accuracy . The method scales as O (N) in both time and memory compared to the direct method with complexity O(N), which allows the solution of larger problems with given resources. Graphical pro...
متن کاملGLUG: GPU Layout of Undirected Graphs
We present a fast parallel algorithm for layout of undirected graphs, using commodity graphics processing unit (GPU) hardware. The GLUG algorithm creates a force-based layout minimizing the Kamada Kawai energy of the graph embedding. Two parameters control the graph layout: the number of landmarks used in the force simulation determines the influence of the global structure, while the number of...
متن کاملAn Implementation of Low-Frequency Fast Multipole BIEM for Helmholtz’ Equation on GPU
Acceleration of the fast multipole method (FMM), which is the fast and approximate algorithm to compute the pairwise interactions among many bodies, with graphics processing units (GPUs) has been investigated for the last couple of years. In view of the type of kernel functions, the non-oscillatory kernels (especially, the Laplace kernel) were studied by many researchers (e.g. Gumerov), and the...
متن کاملDynamic Autotuning of Adaptive Fast Multipole Methods on Hybrid Multicore CPU and GPU Systems
We discuss an implementation of adaptive fast multipole methods targeting hybrid multicore CPUand GPU-systems. From previous experiences with the computational profile of our version of the fast multipole algorithm, suitable parts are off-loaded to the GPU, while the remaining parts are threaded and executed concurrently by the CPU. The parameters defining the algorithm affects the performance ...
متن کاملParallel Algorithms for Constructing Data Structures for Fast Multipole Methods
We present efficient algorithms to build data structures and the lists needed for fast multipole methods. The algorithms are capable of being efficiently implemented on both serial, data parallel GPU and on distributed architectures. With these algorithms it is possible to map the FMM efficiently on to the GPU or distributed heterogeneous CPU-GPU systems. Further, in dynamic problems, as the di...
متن کامل